A note on independent domination in graphs of girth 5
نویسنده
چکیده
Let G be a simple graph of order n, maximum degree ∆ and minimum degree δ ≥ 2. The independent domination number i(G) is defined to be the minimum cardinality among all maximal independent sets of vertices of G. The girth g(G) is the minimum length of a cycle in G. We establish sharp upper and lower bounds, as functions of n, ∆ and δ, for the independent domination number of graphs G with g(G) = 5.
منابع مشابه
A note on independent domination in graphs of girth 6
Let G be a simple graph of order n, maximum degree Δ and minimum degree δ ≥ 2. The independent domination number i(G) is defined to be the minimum cardinality among all maximal independent sets of vertices of G. The girth g(G) is the minimum length of a cycle in G. We establish best possible upper and lower bounds, as functions of n, Δ and δ, for the independent domination number of graphs G wi...
متن کاملDomination in Graphs of Minimum Degree at least Two and Large Girth
We prove that for graphs of order n, minimum degree δ ≥ 2 and girth g ≥ 5 the domination number γ satisfies γ ≤ ( 1 3 + 2 3g ) n. As a corollary this implies that for cubic graphs of order n and girth g ≥ 5 the domination number γ satisfies γ ≤ ( 44 135 + 82 135g ) n which improves recent results due to Kostochka and Stodolsky (An upper bound on the domination number of n-vertex connected cubic...
متن کاملOn independent domination numbers of grid and toroidal grid directed graphs
A subset $S$ of vertex set $V(D)$ is an {em indpendent dominating set} of $D$ if $S$ is both an independent and a dominating set of $D$. The {em indpendent domination number}, $i(D)$ is the cardinality of the smallest independent dominating set of $D$. In this paper we calculate the independent domination number of the { em cartesian product} of two {em directed paths} $P_m$ and $P_n$ for arbi...
متن کاملIndependent domination in directed graphs
In this paper we initialize the study of independent domination in directed graphs. We show that an independent dominating set of an orientation of a graph is also an independent dominating set of the underlying graph, but that the converse is not true in general. We then prove existence and uniqueness theorems for several classes of digraphs including orientations of complete graphs, paths, tr...
متن کاملNote on the bondage number of graphs on topological surfaces
The bondage number b(G) of a graph G is the smallest number of edges whose removal from G results in a graph with larger domination number. In this paper, we present new upper bounds for b(G) in terms of girth, order and Euler characteristic.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Australasian J. Combinatorics
دوره 40 شماره
صفحات -
تاریخ انتشار 2008